Second order cone programming formulation of the fixed cost allocation in DEA based on Nash bargaining game
نویسندگان
چکیده
<p style='text-indent:20px;'>A vital issue in many organizations is the fair allocation of fixed cost among its subsets. In this paper, using data envelopment analysis, first we study based on both additive and multiplicative efficiency decompositions cooperative context for a two-stage structure presence exogenous inputs outputs. A conic relaxation formulation decomposition given. Then, leader-follower paradigm are presented. sequel, allocating between stages, results model, present nonlinear Nash bargaining game model that independent score each unit, allocates to stages. The reformulated as second order cone program which an imporvement over parametric linear models literature. Finally, two examples used illustrate proposed compare their with existing models.</p>
منابع مشابه
Fixed cost and resource allocation based on DEA cross-efficiency
In many managerial applications, situations frequently occur when a fixed cost is used in constructing the common platform of an organization, and needs to be shared by all related entities, or decision making units (DMUs). It is of vital importance to allocate such a cost across DMUs where there is competition for resources. Data envelopment analysis (DEA) has been successfully used in cost an...
متن کاملWaveform Design using Second Order Cone Programming in Radar Systems
Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...
متن کاملSecond-order cone programming
Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Linear programs, convex quadratic programs and quadratically constrained convex quadratic programs can all be formulated as SOCP problems, as can many other problems t...
متن کاملA Second Order Cone programming Formulation for Classifying Missing Data
We propose a convex optimization based strategy to deal with uncertainty in the observations of a classification problem. We assume that instead of a sample (xi, yi) a distribution over (xi, yi) is specified. In particular, we derive a robust formulation when the distribution is given by a normal distribution. It leads to Second Order Cone Programming formulation. Our method is applied to the p...
متن کاملSecond-order cone programming formulation for two player zero-sum game with chance constraints
We consider a two player finite strategic zero-sum game where each player has stochastic linear constraints. We formulate the stochastic constraints of each player as chance constraints. We show the existence of a saddle point equilibrium if the row vectors of the random matrices, defining the stochastic constraints of each player, are elliptically symmetric distributed random vectors. We furth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algebra, Control and Optimization
سال: 2022
ISSN: ['2155-3297', '2155-3289']
DOI: https://doi.org/10.3934/naco.2021032